Reductions of Young Tableau Bijections

نویسندگان

Igor Pak

Ernesto Vallejo

چکیده

We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a number of classical bijections, and establish formal connections between them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorics of Tableau Inversions

A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T yet lack the appropriate relative ordering to make T columnstandard. An i-inverted Young tableau is a row-standard tableau along with precisely i inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number o...

متن کامل

A variation on the tableau switching and a Pak-Vallejo’s conjecture

Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commutativity of the Littlewood-Richardson coefficients cμ,ν = cν,μ. They have considered four fundamental symmetry maps and conjectured that they are all equivalent (2004). The three first ones are based on standard operations in Young tableau theory and, in this case, the conjecture was proved by Dani...

متن کامل

Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices

We discuss bijections that relate families of chains in lattices associated to an order P and families of interval orders deened on the ground set of P. Two bijections of this type have been known: (1) The bijection between maximal chains in the antichain lattice A(P) and the linear extensions of P. (2) A bijection between maximal chains in the lattice of maximal antichains A M (P) and minimal ...

متن کامل

Osculating Paths and Oscillating Tableaux

The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share...

متن کامل